Polling Models with Unequal Service Rates under Limited Service Policies - Sharp Asymptotics
نویسنده
چکیده
We derive asymptotic expressions for the distribution of the total queue length in a polling model with two classes of customers and unequal service rates. The server employs a scheduling policy that alternately visits each queue, with the maximum number served in each visit potentially being different for each queue. We provide sufficient conditions for the behaviour to lie in one of two regimes, depending on the system parameters. The first regime, called codominant, has both queues tending to grow as the total system size grows. The single-class dominant regime has only one queue tending to grow as the total system size grows. Finally, we present numerical results that demonstrate that the developed conditions are only sufficient and comment on the implications of this observation.
منابع مشابه
Polling Models Under Limited Service Policies: Sharp Asymptotics
Exact asymptotics for exponential polling models under a general class of limited server scheduling policies are developed. This is done for a system with an arbitrary number of customer types. We find that the asymptotic behaviour can be classified into as many regimes as there are customer types, with the boundaries between regimes depending on the system parameters. To compute exact expressi...
متن کاملHeavy-traffic Limits for Polling Models with Exhaustive Service and Non-fcfs Service Order Policies
We study cyclic polling models with exhaustive service at each queue under a variety of non-FCFS (first-come–first-served) local service orders, namely last-come–first-served with and without preemption, random-order-of-service, processor sharing, the multiclass priority scheduling with and without preemption, shortest-job-first, and the shortest remaining processing time policy. For each of th...
متن کاملQueue Length Performance of Some Non-exhaustive Polling Models with Bernoulli Feedback
We study the queue length performance in non-exhaustive asymmetric polling systems with Bernoulli feedback. We obtain the PGF (Probability Generating Functions) and the mean values of the queue lengths, For the gated polling model, we define two new service policies: departure-gated policy and service-gated policy, and we demonstrate their difference in queueing performance. In an asymmetric sy...
متن کاملStability of Two Exponential Time-limited Polling Models
In this article, we consider the stability of two single-server polling models. More specifically, we will state and prove the stability conditions of single-server polling systems operating under the pure and exhaustive exponential time-limited service discipline. These conditions will be proven for the polling system operating under the periodic polling strategy and preemptive service. The st...
متن کاملOn the stability of a polling system with an adaptive service mechanism
We consider a single-server cyclic polling system with three queues where the server follows an adaptive rule: if it finds one of queues empty in a given cycle, it decides not to visit that queue in the next cycle. In the case of limited service policies, we prove stability and instability results under some conditions which are sufficient but not necessary, in general. Then we discuss open pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- INFOR
دوره 50 شماره
صفحات -
تاریخ انتشار 2012